By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 8, Issue 1, pp. 1-114

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Determining the Chromatic Number of a Graph

Colin McDiarmid

pp. 1-14

BibTeX  Abstract Full Text:  PDF

A Minimum Linear Arrangement Algorithm for Undirected Trees

Yossi Shiloach

pp. 15-32

BibTeX  Abstract Full Text:  PDF

A Partial Analysis of Random Height-Balanced Trees

Mark R. Brown

pp. 33-41

BibTeX  Abstract Full Text:  PDF

Optimal $2$,$3$-Trees

Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, and Lawrence Snyder

pp. 42-59

BibTeX  Abstract Full Text:  PDF

A Round-Off Error Model with Applications to Arithmetic Expressions

Vijay B. Aggarwal and James W. Burgmeier

pp. 60-72

BibTeX  Abstract Full Text:  PDF

Generating Trees and Other Combinatorial Objects Lexicographically

S. Zaks and D. Richards

pp. 73-81

BibTeX  Abstract Full Text:  PDF

Heuristics That Dynamically Organize Data Structures

James R. Bitner

pp. 82-110

BibTeX  Abstract Full Text:  PDF

Total Ordering Problem

J. Opatrny

pp. 111-114

BibTeX  Abstract Full Text:  PDF